Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
591	Fast Algorithms for Computing Tree LCS Shay Mozes1 Dekel Tsur2 Oren Weimann3 Michal Ziv-Ukelson2 1 Brown University Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2008-06-17 10:13:00 Analysis of algorithms Time complexity Tree Spanning tree NP-complete problems Theoretical computer science Computational complexity theory Applied mathematics
592	A linear delay algorithm for building concept lattices Yang Huang National Center for Biotechnology Information, NLM, NIH Joint work with Martin Farach-Colton work done at Department of Computer Science, Rutgers Universi Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2008-06-23 13:16:32 Theoretical computer science Lattice Formal concept analysis Complete lattice Time complexity Polynomial Ideal lattice cryptography Complemented lattice Abstract algebra Lattice theory Mathematics
593	Approximation Algorithms for Orienting Mixed Graphs Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2011-09-25 15:14:20 NP-complete problems Graph Directed graph Strongly connected component Strong orientation Graph coloring Path decomposition Graph theory Mathematics Graph connectivity
594	Randomized and Parameterized Algorithms for the Closest String Problem Zhi-Zhong Chen Tokyo Denki University Joint with Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2014-06-14 17:20:02 Analysis of algorithms NP-complete problems Closest string Randomized algorithm String Time complexity Algorithm 2-satisfiability NP Theoretical computer science Computational complexity theory Applied mathematics
595	arXiv:1107.1052v1 [cs.DS] 6 JulThe traveling salesman problem on cubic and subcubic graphs∗ Sylvia Boyd† Add to Reading List Source URL: arxiv.org Language: English - Date: 2011-07-06 20:12:57 Matching Eulerian path Petersen graph Travelling salesman problem Graph Tree Chordal graph Hamiltonian path Planar graph Graph theory NP-complete problems Cubic graph
596	A Local-Search 2-Approximation for 2-Correlation-Clustering? Tom Coleman, James Saunderson, and Anthony Wirth The University of Melbourne Abstract. CorrelationClustering is now an established problem in Add to Reading List Source URL: tom.thesnail.org Language: English - Date: 2015-05-04 03:09:24 NP-complete problems Matroid theory Spanning tree Signed graph Clique Graph Tree Eulerian path Pseudoforest Graph theory Theoretical computer science Mathematics
597	Flexible Graph Partitioning of Power Grids with Peer-to-peer Electricity Exchange Kazuhiro Minami, Tomoya Tanjo, Nana Arizumi, Hiroshi Maruyama Institute of Statistical Mathematics, Tokyo, Japan Email: {kminami, tanjo, a Add to Reading List Source URL: systemsresilience.org Language: English - Date: 2014-12-15 22:25:12 Network flow NP-complete problems Graph partition Graph operations Maximum flow problem Topology Flow network Connectivity Planar separator theorem Graph theory Theoretical computer science Mathematics
598	Compactness-Preserving Mapping on Trees Jan Baumbach, Jiong Guo, Rashid Ibragimov Network Alignment Comparison of networks/graphs Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2014-06-13 17:44:22 Graph theory Complexity classes NP Graph isomorphism NP-complete problems Theoretical computer science Computational complexity theory Mathematics
599	SOS Lecture 2: Max Cut, Sparsest Cut, Small Set Expansion and some relations of Isoperimetry and Hypercontractivity / Boaz Barak Lecture notes by Adrian Vladu and Henry Yuen Suggested reading • As I mentioned in the em Add to Reading List Source URL: www.boazbarak.org Language: English - Date: 2014-10-29 13:20:10 Combinatorial optimization Degree Cut NP-complete problems Combinatorics Randomized algorithm Euclidean algorithm Mathematics Graph theory Theoretical computer science
600	Practical Partition-Based Theorem Proving for Large Knowledge Bases Sheila McIlraith Bill MacCartney Knowledge Systems Lab Knowledge Systems Lab Computer Science Dept. Computer Science Dept. Stanford University Add to Reading List Source URL: www.ksl.stanford.edu Language: English - Date: 2003-06-20 17:12:42 Automated theorem proving Combinatorics NP-complete problems Graph partition Resolution Partition Tree decomposition First-order logic Mathematics Graph theory Theoretical computer science

UPDATE